Note on $S$-numbers

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on normal numbers

Many cyberinformaticians would agree that, had it not been for the transistor, the construction of link-level acknowledgements might never have occurred. Given the current status of probabilistic modalities, electrical engineers obviously desire the improvement of rasterization, which embodies the structured principles of robotics. In this position paper, we concentrate our efforts on verifying...

متن کامل

A Note on Z-numbers

Decisions are based on information. To be useful, information must be reliable. Basically, the concept of a Z-number relates to the issue of reliability of information. A Z-number, Z, has two components, Z = (A,B). The first component, A, is a restriction (constraint) on the values which a real-valued uncertain variable, X, is allowed to take. The second component, B, is a measure of reliabilit...

متن کامل

A Note on the Strong Law of Large Numbers

Petrov (1996) proved the connection between general moment conditions and the applicability of the strong law of large numbers to a sequence of pairwise independent and identically distributed random variables. This note examines this connection to a sequence of pairwise negative quadrant dependent (NQD) and identically distributed random variables. As a consequence of the main theorem ...

متن کامل

A note on Ramsey numbers for books

The book with n pages Bn is the graph consisting of n triangles sharing an edge. The book Ramsey number r(Bm, Bn) is the smallest integer r such that either Bm ⊂ G or Bn ⊂ G for every graph G of order r. We prove that there exists a positive constant c such that r(Bm, Bn) = 2n + 3 for all n ≥ cm.

متن کامل

A note on non-jumping numbers

Let r ≥ 2 be an integer. A real number α ∈ [0, 1) is a jump for r if there exists c > 0 such that for any ǫ > 0 and any integer m, m ≥ r, there exists an integer n0 such that any r-uniform graph with n > n0 vertices and density ≥ α + ǫ contains a subgraph with m vertices and density ≥ α+ c. It follows from a theorem of Erdős and Stone that every α ∈ [0, 1) is a jump for r = 2. Erdős asked wheth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1953

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1953-0054659-2